On sufficiency and duality for multiobjective programming problems using convexificators

In this paper, we consider a multiobjective programming problem with inequality and set constraints. We derive sufficient conditions for the optimality of feasible point under generalized invexity assumptions in terms convexificators. give an example to illustrate that concept convexificators is weaker than other subdifferentials. formulateWolfe Mond-Weir type duals nonsmooth constraints establish weak, strong, converse, restricted converse strict duality results using between primal Wolfe dual. respective dual pseudoinvexity, pseudoinvexity quasiinvexity also relationship weak vector saddle-point weakly efficient solution problem.